Tesis Yerleştirme (p-Hub) Probleminin Yapay Arı Kolonisi Kullanılarak Çözülmesi

Tesis Doctoral

2.1. Tesis

Star p-hub center problem and star p-hub median problem with bounded path lengths

We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Cent...

Heuristic Solution for the p-hub Problem

The hub location problem is important in the selection of technological networks, such as computer, cellular, or wireless sensor networks. These modern communication networks must be dynamically set as triggered by changes in external conditions; the nodes deplete their batteries and go out of service. For this reason, it is necessary to update the available data in order to determine which nod...

The p-hub center allocation problem

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin–destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We esta...